 |
Linear congruence theorem Totally Explained
|
|  |
|
NEW! |
All the latest news in the worlds of
computer gaming,
entertainment,
the environment,
finance,
health,
politics,
science,
stocks & shares,
technology
and much,
much,
more.
|
Everything about Linear Congruence Theorem totally explainedIn modular arithmetic, the question of when a linear congruence can be solved is answered by the linear congruence theorem. If a and b are any integers and n is a positive integer, then the congruence: ax ≡ b ( mod n) (1)
has a solution for x if and only if b is divisible by the greatest common divisor d of a and n (denoted by gcd( a, n) | b). When this is the case, and x0 is one solution of (1), then the set of all solutions is given by »
|
|